Contingency-Constrained Unit Commitment with Post-Contingency Corrective Recourse

摘要

We consider the problem of minimizing costs in the generation unit commitmentproblem, a cornerstone in electric power system operations, while enforcing anN-k-e reliability criterion. This reliability criterion is a generalization ofthe well-known $N$-$k$ criterion, and dictates that at least $(1-e_ j)$fraction of the total system demand must be met following the failures of $k$or fewer system components. We refer to this problem as theContingency-Constrained Unit Commitment problem, or CCUC. We present amixed-integer programming formulation of the CCUC that accounts for bothtransmission and generation element failures. We propose novel cutting planealgorithms that avoid the need to explicitly consider an exponential number ofcontingencies. Computational studies are performed on several IEEE test systemsand a simplified model of the Western US interconnection network, whichdemonstrate the effectiveness of our proposed methods relative to currentstate-of-the-art.